Private Computation: k-Connected versus 1-Connected Networks
نویسندگان
چکیده
منابع مشابه
Minimally (k, k-1)-edge-connected graphs
For an interger l > 1, the l-edge-connectivity λl(G) of G is defined to be the smallest number of edges whose removal leaves a graph with at least l components, if |V (G)| ≥ l; and λl(G) = |V (G)| if |V (G)| ≤ l. A graph G is (k, l)-edge-connected if the l-edge-connectivity of G is at least k. A sufficient and necessary condition for G to be minimally (k, k − 1)-edgeconnected is obtained in the...
متن کاملInterference Minimization in k-Connected Wireless Networks
Given a set of positions for wireless nodes, the kconnected interference minimization problem seeks to assign a transmission radius to each node such that the resulting network is k-connected and the maximum interference is minimized. We show there exist sets of n points on the line for which any k-connected network has maximum interference Ω( √ kn). We present polynomial-time algorithms that a...
متن کاملComputation and design of locally-connected Internet exchange networks
The Internet is comprised of independently operated networks (Internet Service Providers, or ISPs) that work to bring traffic from content providers to end users. To facilitate the handoff of traffic, ISPs commonly form agreements with each other. From the perspective of the end user, it is critical that their Internet content loads quickly; while there are several factors impacting the page lo...
متن کامل3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected
We investigate pairs of forbidden subgraphs that imply a 3-connected graph is Hamiltonian-connected. In particular we show that the pair {K1,3, P9} is such a pair. As it is known that P10 cannot replace P9, this result is best possible. Further, we show that certain other graphs are not possible.
متن کاملNode-Optimal Connected k-Subgraphs
In this paper we consider the problem of optimally selecting a set of k nodes in a node-weighted graph, under the requirement that the subgraph induced by the set of nodes selected is connected. This problem arises in a Norwegian oo-shore oil-drilling application. We show this problem to be NP-complete on general graphs, but provide a polynomial time algorithm to nd an optimal solution for tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2005
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-005-0329-x